Logarithms in Real-quadratic Orders
نویسندگان
چکیده
We generalize and improve the schemes of [4]. We introduce analogues of exponentiation and cliscrele logarithms in the principle cycle of real quadratic orders. This enables us t o implement many cryptographic protocols based on discrete logarithms, e.g. a variant of the signature scheme of ElGamal [S].
منابع مشابه
Cryptographic Protocols Based on Discrete Logarithms in Real-quadratic Orders
We generalize and improve the schemes of 4]. We introduce analogues of exponentiation and discrete logarithms in the principle cycle of real quadratic orders. This enables us to implement many cryptographic protocols based on discrete logarithms, e.g. a variant of the signature scheme of ElGamal 8].
متن کاملReducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields
Since nobody can guarantee that the computation of discrete logarithms in elliptic curves or IF p remains intractible for the future it is important to study cryptosystems based on alternative groups. A promising candidate, which was proposed by Buch-mann and Williams 8], is the class group C l(() of an imaginary quadratic order O. This ring is isomorphic to the endomorphism ring of a non-super...
متن کاملSecurity of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders
In this work we investigate the difficulty of the discrete logarithm problem in class groups of imaginary quadratic orders. In particular, we discuss several strategies to compute discrete logarithms in those class groups. Based on heuristic reasoning, we give advice for selecting the cryptographic parameter, i.e. the discriminant, such that cryptosystems based on class groups of imaginary quad...
متن کاملSubexponential Class Group Computation in Quadratic Orders (abstract)
In 1989, the first subexponential algorithm for computing the class group of an imaginary quadratic order was introduced by Hafner and McCurley. Their algorithm is based on an integer factorization algorithm due to Seysen, and is conditional on the truth of the Extended Riemann Hypothesis. Not long after, their result was generalized to arbitrary algebraic number fields by Buchmann. Efficient v...
متن کاملComputing discrete logarithms in real quadratic congruence function fields of large genus
The discrete logarithm problem in various finite abelian groups is the basis for some well known public key cryptosystems. Recently, real quadratic congruence function fields were used to construct a public key distribution system. The security of this public key system is based on the difficulty of a discrete logarithm problem in these fields. In this paper, we present a probabilistic algorith...
متن کامل